From 42e2ab13d41504046105176f6a296717756cc96b Mon Sep 17 00:00:00 2001 From: srinivasreddy Date: Tue, 15 Mar 2016 00:56:26 +0530 Subject: [PATCH] corrected statement regarding constraintgraph solving problem type --- src/cargo/core/resolver/mod.rs | 7 +++---- 1 file changed, 3 insertions(+), 4 deletions(-) diff --git a/src/cargo/core/resolver/mod.rs b/src/cargo/core/resolver/mod.rs index 8304756d1..105f77eba 100644 --- a/src/cargo/core/resolver/mod.rs +++ b/src/cargo/core/resolver/mod.rs @@ -6,10 +6,9 @@ //! which is more worried about discovering crates from various sources, this //! module just uses the Registry trait as a source to learn about crates from. //! -//! Actually solving a constraint graph is an NP-hard (or NP-complete, I forget -//! which) problem, this the algorithm is basically a nice heuristic to make -//! sure we get roughly the best answer most of the time. The constraints that -//! we're working with are: +//! Actually solving a constraint graph is an NP-hard problem. This algorithm +//! is basically a nice heuristic to make sure we get roughly the best answer +//! most of the time. The constraints that we're working with are: //! //! 1. Each crate can have any number of dependencies. Each dependency can //! declare a version range that it is compatible with. -- 2.30.2